Cryptographic relational algebra for databases using the field authenticator

نویسندگان

  • Chien-Yuan Chen
  • Cheng-Yuan Ku
  • David C. Yen
چکیده

In this paper, a field authentication scheme, suitable for providing more efficient operations within an encrypted database, is introduced and discussed. Applying the concept of this proposed scheme, the database will be safeguarded and protected for situations such as a ciphertext search attack, a plaintext substitution attack, and/or a ciphertext substitution attack. In addition, this proposed scheme can be used to facilitate the “projections” operation executed in the database while also allowing the individual field value to be decrypted and authenticated. It is also important to note that the “selection” operation can be directly applied to the resultant database without the tediousness of going through the decryption process by using the random filters concept in the field authentication. Furthermore, the use of the aforementioned concept can eliminate exposure of some unqualified records and, as a result, speed up the process of executing the query. c © 2007 Elsevier Ltd. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relational Databases Query Optimization using Hybrid Evolutionary Algorithm

Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...

متن کامل

Variable Independence in Constraint Databases

In this paper, we study constraint databases with variable independence conditions (vics). Such databases occur naturally in the context of temporal and spatiotemporal database applications. Using computational geometry techniques, we show that variable independence is decidable for linear constraint databases. We also present a set of rules for inferring vics in relational algebra expressions....

متن کامل

An Algebra for Probabilistic Databases

An algebra is presented for a simple probabilistic data model that may be regarded as an extension of the standard relational model. The probabilistic algebra is developed in such a way that (restricted to α -acyclic database schemes) the relational algebra is a homomorphic image of it. Strictly probabilistic results are emphasized. Variations on the basic probabilistic data model are discussed...

متن کامل

An Algebra and Equivalences to Transform Graph Patterns in Neo4j

Modern query optimizers of relational database systems embody more than three decades of research and practice in the area of data management and processing. Key advances include algebraic query transformation, intelligent search space pruning, and modular optimizer architectures. Surprisingly, many of these contributions seem to have been overlooked in the emerging field of graph databases so ...

متن کامل

An Extended Algebra for Constraint

| Constraint relational databases use constraints to both model and query data. A constraint relation contains a nite set of generalized tuples. Each generalized tuple is represented by a conjunction of constraints on a given logical theory and, depending on the logical theory and the speciic conjunction of constraints, it may possibly represent an in-nite set of relational tuples. For their ch...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computers & Mathematics with Applications

دوره 54  شماره 

صفحات  -

تاریخ انتشار 2007